Agent-Based Distributed Routing Algorithm with Traffic Prediction for LEO Satellite Network

نویسندگان

  • Zhenyu Na
  • Zihe Gao
  • Yang Cui
  • Liming Chen
  • Qing Guo
چکیده

Satellite network, especially low earth orbit (LEO) satellite network, which has advantages of global coverage and short round-trip time (RTT), has played an increasingly important role in the future generation of global communication network. Due to fast velocity, frequent handover and time-varying topology, designing effective routing algorithm for LEO satellite network has always been challenging. An Agent-based distributed Routing Algorithm with Traffic Prediction (TPARA) is proposed in this paper. TPARA algorithm, which fully takes traffic density of the surface of the Earth into account, consists of two parts: traffic prediction and routing decision. In the former, not only the heterogeneity of traffic on the ground is considered, but upcoming traffic from terrestrial terminals is predicted using an improved Kalman filtering as well. In the latter, mobile agents (MAs) are used to explore satellite network and collect routing information. The ultimate routing decision is determined by both current status and future status of satellite network. Simulation results show that, compared with the classical algorithm of ACO, TPARA not only has shorter delay, but alleviates congestion as well.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

QoS Routing Algorithm Applying Multi-Agent System for LEO Satellite Network

Satellite network is the essential part of the future generation of hybrid communication networks. Considering the surging demands for multimedia traffic across the globe, the dynamic time-varying topology of low earth orbit (LEO) satellite network and the flaws of existing QoS (Quality of Service) routing algorithms, a novel QoS routing algorithm applying multi-agent system (MAQR) for LEO sate...

متن کامل

A Routing Algorithm for Mpls Traffic Engineering in Leo Satellite Constellation Network

With regard to the limited link time of the inter-satellite links in LEO satellite constellation network, this paper proposes a routing algorithm which takes the limited link time into account, and supports traffic engineering. The routing algorithm is based on MPLS satellite network. The initial weight of links is defined to be function of residual bandwidth and link time. And during the weigh...

متن کامل

Distributed Traffic Balancing Routing for LEO Satellite Networks

Satellite networks have been widely investigated both in the business and academia for many years, with many important routing algorithms reported in the literatures. However, fewer existing routing algorithms focus on the trade-off between the routing survivability and the routing computation and storage overheads. Due to topological dynamics, it is difficult to effectively apply the conventio...

متن کامل

User-based Vehicle Route Guidance in Urban Networks Based on Intelligent Multi Agents Systems and the ANT-Q Algorithm

Guiding vehicles to their destination under dynamic traffic conditions is an important topic in the field of Intelligent Transportation Systems (ITS). Nowadays, many complex systems can be controlled by using multi agent systems. Adaptation with the current condition is an important feature of the agents. In this research, formulation of dynamic guidance for vehicles has been investigated based...

متن کامل

A Discrete-Time Traffic and Topology Adaptive Routing Algorithm for LEO Satellite Networks

“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algorithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adaptive routing (DT-TTAR) algorithm is proposed in this paper. This routing a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013